Stanley–Reisner resolution of constant weight linear codes
نویسندگان
چکیده
منابع مشابه
Stanley-Reisner resolution of constant weight linear codes
Given a constant weight linear code, we investigate its weight hierarchy and the Stanley-Reisner resolution of its associated matroid regarded as a simplicial complex. We also exhibit conditions on the higher weights sufficient to conclude that the code is of constant weight.
متن کاملUnderstanding Linear Codes of Constant Weight Using Virtual Linear Codes
In this paper we determine completely the structure of linear codes over Z/NZ of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, Lee weight, and Euclidean weight. We prove a general uniqueness theorem for virtual linear codes of constant...
متن کاملOptimal linear codes, constant-weight codes and constant-composition codes over $\Bbb F_{q}$
Optimal linear codes and constant-weight codes play very important roles in coding theory and have attached a lot of attention. In this paper, we mainly present some optimal linear codes and some optimal constant-weight codes derived from the linear codes. Firstly, we give a construction of linear codes from trace and norm functions. In some cases, its weight distribution is completely determin...
متن کاملThe Structure of Linear Codes of Constant Weight
In this paper we determine completely the structure of linear codes over Z/NZ of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, Lee weight, two forms of Euclidean weight, and pre-homogeneous weights. We prove a general uniqueness theore...
متن کاملImproved Linear Programming Bounds on Sizes of Constant-Weight Codes
Let A(n, d, w) be the largest possible size of an (n, d, w) constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on A(n, d, w) for n ≤ 28. The used techniques allow us to give a simple proof of an important theorem of Delsarte which makes linear programming possible for binary codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2012
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-012-9767-2